package leetcode.m1.d7;

public class Solution {
    public int minMutation(String start, String end, String[] bank) {
//        fori
        return 0;
    }

    private boolean change(String a,String b){
        char[] chars = a.toCharArray();
        char[] chars1 = b.toCharArray();
        int count = 0;
        for (int i = 0; i < chars1.length; i++) {
            if (chars[i] == chars1[i]){
                continue;
            }
            count++;
            if (count >1){
                return false;
            }
        }
        return true;
    }
}

